Mixing times of the biased card shuffling and the asymmetric exclusion process Itai Benjamini
نویسندگان
چکیده
Consider the following method of card shuffling. Start with a deck of N cards numbered 1 through N. Fix a parameter p between 0 and 1. In this model a " shuffle " consists of uniformly selecting a pair of adjacent cards and then flipping a coin that is heads with probability p. If the coin comes up heads then we arrange the two cards so that the lower numbered card comes before the higher numbered card. If the coin comes up tails then we arrange the cards with the higher numbered card first. In this paper we prove that for all p = 1/2, the mixing time of this card shuffling is O(N 2), as conjectured by Diaconis and Ram [7]. A novel feature of our proof is that the analysis of an infinite (asymmetric exclusion) process plays an essential role in bounding the mixing time of a finite process.
منابع مشابه
Mixing times of the Biased Card Shuffling and the Asymmetric Exclusion Process
Consider the following method of card shuffling. Start with a deck of N cards numbered 1 through N . Fix a parameter p between 0 and 1. In this model a “shuffle” consists of uniformly selecting a pair of adjacent cards and then flipping a coin that is heads with probability p. If the coin comes up heads, then we arrange the two cards so that the lower-numbered card comes before the higher-numbe...
متن کاملSampling Biased Monotonic Surfaces using Exponential Metrics
Monotonic surfaces spanning finite regions of Z arise in many contexts, including DNAbased self-assembly, card-shuffling and lozenge tilings. One method that has been used to uniformly generate these surfaces is a Markov chain that iteratively adds or removes a single cube below the surface during a step. We consider a biased version of the chain, where we are more likely to add a cube than to ...
متن کاملGaps: the Strategy behind a Speedy Coupling of Card Shuffling
Using methods of coupling we analyze two models of card shuffling, the random transposition and the random-to-random process, to find minimal coupling times. Disregarding the rank and suit on the standard playing cards we are familiar with, we focus only on the color; specifically, we consider decks where half the cards are white and half are black. We define the total gaps on a pair of decks, ...
متن کاملHow, when and how much a card deck is well shuffled?
The thesis consider the mixing of few (3-4) card shuffling as well as of large (52 card) deck. The thesis is showing the limit on the shuffling to homogeneity elaborated in short program; the thesis is in italian.
متن کاملRobust Mixing
In this paper, we develop a new“robust mixing” framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducible Markov Chain with stationary distribution π. An adversary announces a sequence of stochastic matrices {At}t>0 satisfying πAt = π. An AMMC process involves an application of P followed by At at time t. The robust mixing time of...
متن کامل